The number of convex permutominoesBOLDI, Paolo; LONATI, Violetta; RADICIONI, Roberto et al.Information and computation (Print). 2008, Vol 206, Num 9-10, pp 1074-1083, issn 0890-5401, 10 p.Conference Paper

Knights, spies, games and ballot sequencesWILDON, Mark.Discrete mathematics. 2010, Vol 310, Num 21, pp 2974-2983, issn 0012-365X, 10 p.Article

A simple algorithm for Mal'tsev constraintsBULATOV, Andrei; DALMAU, Victor.SIAM journal on computing (Print). 2007, Vol 36, Num 1, pp 16-27, issn 0097-5397, 12 p.Article

Holographic reduction for some counting problemsCHEN YUAN; HAIBIN KAN.Information processing letters. 2011, Vol 111, Num 15, pp 761-766, issn 0020-0190, 6 p.Article

ON THE PARAMETERIZED COMPLEXITY OF APPROXIMATE COUNTINGANDRES MONTOYA, J.Informatique théorique et applications (Imprimé). 2011, Vol 45, Num 2, pp 197-223, issn 0988-3754, 27 p.Article

Some decision and counting problems of the Duquenne-Guigues basis of implicationsKUZNETSOV, Sergei O; OBIEDKOV, Sergei.Discrete applied mathematics. 2008, Vol 156, Num 11, pp 1994-2003, issn 0166-218X, 10 p.Article

On the hardness of counting problems of complete mappingsJIEH HSIANG; HSU, D. Frank; SHIEH, Yuh-Pyng et al.Discrete mathematics. 2004, Vol 277, Num 1-3, pp 87-100, issn 0012-365X, 14 p.Article

Universal relations and #P-completenessFOURNIER, Hervé; MALOD, Guillaume.Theoretical computer science. 2008, Vol 407, Num 1-3, pp 97-109, issn 0304-3975, 13 p.Article

Formal and incremental construction of distributed algorithms : On the distributed reference counting algorithmCANSELL, Dominique; MERY, Dominique.Theoretical computer science. 2006, Vol 364, Num 3, pp 318-337, issn 0304-3975, 20 p.Conference Paper

APPROXIMATELY COUNTING INTEGRAL FLOWS AND CELL-BOUNDED CONTINGENCY TABLESCRYAN, Mary; DYER, Martin; RANDALL, Dana et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 2683-2703, issn 0097-5397, 21 p.Article

Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytopeDA FONSECA, C. M; MARQUES DE SA, E.Discrete mathematics. 2008, Vol 308, Num 7, pp 1308-1318, issn 0012-365X, 11 p.Article

Unification algorithms cannot be combined in polynomial timeHERMANN, Miki; KOLAITIS, Phokion G.Information and computation (Print). 2000, Vol 162, Num 1-2, pp 24-42, issn 0890-5401Article

Complexity issues on bounded restrictive H-coloringDIAZ, Josep; SERNA, Maria; THILIKOS, Dimitrios M et al.Discrete mathematics. 2007, Vol 307, Num 16, pp 2082-2093, issn 0012-365X, 12 p.Article

The complexity of equivalence and isomorphism of systems of equations over finite groupsNORDH, Gustay.Theoretical computer science. 2005, Vol 345, Num 2-3, pp 406-424, issn 0304-3975, 19 p.Conference Paper

More decidable instances of Post's correspondence problem : beyond countingRAHN, Mirko.Information processing letters. 2008, Vol 106, Num 3, pp 115-119, issn 0020-0190, 5 p.Article

Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point setGOSWAMI, Partha P; DAS, Sandip; NANDY, Subhas C et al.Information processing letters. 2007, Vol 102, Num 4, pp 163-168, issn 0020-0190, 6 p.Article

Good splitters for counting points in trianglesMATOUSEK, J; WELZL, E.Journal of algorithms (Print). 1992, Vol 13, Num 2, pp 307-319, issn 0196-6774Article

Counting preimages of TCP reordering patternsHANSSON, Anders; ISTRATE, Gabriel.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3187-3193, issn 0166-218X, 7 p.Conference Paper

Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizationsFEDER, Tomas; SUBI, Carlos.Information processing letters. 2009, Vol 109, Num 5, pp 267-272, issn 0020-0190, 6 p.Article

Towards a dichotomy theorem for the counting constraint satisfaction problemBULATOV, Andrei A; DALMAU, Victor.Information and computation (Print). 2007, Vol 205, Num 5, pp 651-678, issn 0890-5401, 28 p.Article

Computational complexity of counting problems on 3-regular planar graphsMINGJI XIA; PENG ZHANG; WENBO ZHAO et al.Theoretical computer science. 2007, Vol 384, Num 1, pp 111-125, issn 0304-3975, 15 p.Conference Paper

A computational proof of complexity of some restricted counting problemsCAI, Jin-Yi; PINYAN LU; MINGJI XIA et al.Theoretical computer science. 2011, Vol 412, Num 23, pp 2468-2485, issn 0304-3975, 18 p.Article

Counting truth assignments of formulas of bounded tree-width or clique-widthFISCHER, E; MAKOWSKY, J. A; RAVVE, E. V et al.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 511-529, issn 0166-218X, 19 p.Conference Paper

Concurrent counting is harder than queuingBUSCH, Costas; TIRTHAPURA, Srikanta.Theoretical computer science. 2010, Vol 411, Num 43, pp 3823-3833, issn 0304-3975, 11 p.Article

On listing, sampling, and counting the chordal graphs with edge constraintsKIJIMA, Shuji; KIYOMI, Masashi; OKAMOTO, Yoshio et al.Theoretical computer science. 2010, Vol 411, Num 26-28, pp 2591-2601, issn 0304-3975, 11 p.Article